Database searching using a graph of nodes and edges formed using  log node pairs

ABSTRACT

Disclosed are examples of systems, apparatus, methods and computer program products for generating or updating a graph of nodes and edges using logs, where the graph can be used for database searching. In some implementations, a server can identify logs. Based on the identified logs, log nodes can be generated or updated. Log nodes can be sorted in a first ordered list according to each log node&#39;s key data. Log node pairs can be determined from the log nodes in the first list. The log node pairs can be aggregated and sorted into a second ordered list. A graph of nodes and edges can be generated or updated according to the relative importances of the log node pairs in the second ordered list.

COPYRIGHT NOTICE

A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure as it appears in the United States Patent and Trademark Office patent file or records but otherwise reserves all copyright rights whatsoever.

TECHNICAL FIELD

This patent document generally relates to logs in the context of database systems. More specifically, this patent document discloses techniques for creating or updating a graph of nodes and edges using logs, where the graph can be used for database searching.

BACKGROUND

“Cloud computing” services provide shared resources, applications, and information to computers and other devices upon request. In cloud computing environments, services can be provided by one or more servers accessible over the Internet rather than installing software locally on in-house computer systems. As such, users having a variety of roles can interact with cloud computing services.

BRIEF DESCRIPTION OF THE DRAWINGS

The included drawings are for illustrative purposes and serve only to provide examples of possible structures and operations for the disclosed inventive systems, apparatus, methods and computer program products. These drawings in no way limit any changes in form and detail that may be made by one skilled in the art without departing from the spirit and scope of the disclosed implementations.

FIG. 1 shows a system diagram of an example of a database system 100 for managing search results of customer relationship management (CRM) data objects, in accordance with some implementations.

FIG. 2 shows a flow chart of an example of a method 200 for generating or updating a graph of nodes and edges to manage search results of data objects in a database system, in accordance with some implementations.

FIG. 3 shows an example of an arrangement of log nodes and log node pairs for generating a graph of nodes and edges, in accordance with some implementations.

FIG. 4 shows an example of a graph of nodes and edges 400 generated or updated using log node pairs, in accordance with some implementations.

FIG. 5 shows an example of a user interface 500 with search results from a graph of nodes and edges generated or updated using log node pairs, in accordance with some implementations.

FIG. 6A shows a block diagram of an example of an environment 10 in which an on-demand database service can be used in accordance with some implementations.

FIG. 6B shows a block diagram of an example of some implementations of elements of FIG. 6A and various possible interconnections between these elements.

FIG. 7A shows a system diagram of an example of architectural components of an on-demand database service environment 900, in accordance with some implementations.

FIG. 7B shows a system diagram further illustrating an example of architectural components of an on-demand database service environment, in accordance with some implementations.

DETAILED DESCRIPTION

Examples of systems, apparatus, methods and computer-readable storage media according to the disclosed implementations are described in this section. These examples are being provided solely to add context and aid in the understanding of the disclosed implementations. It will thus be apparent to one skilled in the art that implementations may be practiced without some or all of these specific details. In other instances, certain operations have not been described in detail to avoid unnecessarily obscuring implementations. Other applications are possible, such that the following examples should not be taken as definitive or limiting either in scope or setting.

In the following detailed description, references are made to the accompanying drawings, which form a part of the description and in which are shown, by way of illustration, specific implementations. Although these implementations are described in sufficient detail to enable one skilled in the art to practice the disclosed implementations, it is understood that these examples are not limiting, such that other implementations may be used and changes may be made without departing from their spirit and scope. For example, the operations of methods shown and described herein are not necessarily performed in the order indicated. It should also be understood that the methods may include more or fewer operations than are indicated. In some implementations, operations described herein as separate operations may be combined. Conversely, what may be described herein as a single operation may be implemented in multiple operations.

Some implementations of the disclosed systems, apparatus, methods and computer program products are configured for creating a graph of nodes and edges, also referred to herein as a weighted graph, to manage search results of data objects in a database system. For example, customer relationship management (CRM) records of an enterprise can be effectively searched and ranked using some implementations of the disclosed techniques.

In a conventional enterprise environment, a user such as a customer of the enterprise can manually search a database system for data objects such as knowledge articles, user profiles, tasks, social network feed items, and CRM records such as opportunities, leads, accounts, cases, contacts, contracts, etc. Database search results are often returned in response to a search query submitted by a user. However, search results are often voluminous and irrelevant to specific details the customer is searching for, resulting in inefficient use of the database system and user frustration.

By way of illustration, Spoke and Hub is a bicycle manufacturer specializing in state of the art racing bicycles. Spoke and Hub leads the industry in customer support, setting them apart from other bicycle manufacturers. Kim, a long-time customer of Spoke and Hub, has purchased many of their bicycles. Recently, Kim's newest bicycle has begun making an unusual noise when she rides up steep hills. As an avid rider of steep hills, she wants to fix the bicycle as soon as possible.

In the past, Kim has often relied on Spoke and Hub's customer support to find immediate solutions to her problems. As such, Kim calls Spoke and Hub about the unusual noise. Kim speaks with Mitch, a customer service representative at Spoke and Hub. As Kim describes the unusual noise to Mitch, he quickly realizes he does not have an answer to Kim's problem. Mitch puts Kim on hold, and he searches for a solution using Spoke and Hub's database system. Mitch performs several database searches using different combinations of keywords describing Kim's problem. However, each search comes back with irrelevant search results. After a few minutes, Mitch tells Kim that he does not have an answer yet, and he will contact her later when he finds an answer. Kim ends the call in disappointment, and she considers selling her bicycle and buying from a different manufacturer.

Some of the disclosed techniques can be implemented to create a weighted graph from user logs in order to return more relevant database search results than conventional systems. By way of example, an enterprise may maintain a database system storing a respective log for each user of the system. In this example, a log records each action by the user in a computing environment monitored by a server. User actions such as selections of graphical components in a user interface, navigation to various web pages or to document presentations, requests for data objects such as records, documents, files, etc. from a database or other data source, user access of such objects, etc. can be recorded in a user's log. For instance, a user clicking on a tab in a user interface to retrieve details of a specific case, Case XYZ, and thereby navigating away from a tab displaying a knowledge article, Article ABC can be recorded in a log as one or more actions.

Using some implementations of the disclosed techniques for generating weighted graphs using such logs, database search results returned in response to a keyword-based search query may be better ranked in order of relevance and/or importance. For example, multiple users' logs may be used to create a weighted graph of the frequency that various data objects are accessed over a period of time, and the order of the search results may be determined using the graph.

In an alternative illustrative scenario to that described above, as Mitch searches for an answer to Kim's problem, database search results are ranked using a weighted graph generated using all of the customer service representatives' logs. Using the weighted graph, a knowledge article titled “Hill Riding Noise for New Models” is at the top of a list of search results. Mitch is able to immediately identify and view the article to quickly give Kim an answer. In this example, the order of the search results is based in part on the number of times and frequency of customer service representatives clicking through one or more knowledge article links displayed in a user interface to access the “Hill Riding Noise for New Models” article.

These and other implementations may be embodied in various types of hardware, software, firmware, and combinations thereof. For example, some techniques disclosed herein may be implemented, at least in part, by computer-readable media that include program instructions, state information, etc., for performing various services and operations described herein. Examples of program instructions include both machine code, such as produced by a compiler, and files containing higher-level code that may be executed by a computing device such as a server or other data processing apparatus using an interpreter. Examples of computer-readable media include, but are not limited to, magnetic media such as hard disks, floppy disks, and magnetic tape; optical media such as CD-ROM disks; magneto-optical media; and hardware devices that are specially configured to store program instructions, such as read-only memory (“ROM”) devices and random access memory (“RAM”) devices. These and other features of the disclosed implementations will be described in more detail below with reference to the associated drawings.

In some but not all implementations, the disclosed methods, apparatus, systems, and computer-readable storage media may be configured or designed for use in a multi-tenant database environment.

The term “multi-tenant database system” can refer to those systems in which various elements of hardware and software of a database system may be shared by one or more customers. For example, a given application server may simultaneously process requests for a great number of customers, and a given database table may store rows of data such as feed items for a potentially much greater number of customers. The term “query plan” generally refers to one or more operations used to access information in a database system.

A “user profile” or “user's profile” is generally configured to store and maintain data about a given user of the database system. The data can include general information, such as name, title, phone number, a photo, a biographical summary, and a status, e.g., text describing what the user is currently doing. As mentioned below, the data can include messages created by other users. Where there are multiple tenants, a user is typically associated with a particular tenant. For example, a user could be a salesperson of a company, which is a tenant of the database system that provides a database service.

The term “record” generally refers to a data entity, such as an instance of a data object created by a user of the database service, for example, about a particular (actual or potential) business relationship or project. The data object can have a data structure defined by the database service (a standard object) or defined by a user (custom object). For example, a record can be for a business partner or potential business partner (e.g., a client, vendor, distributor, etc.) of the user, and can include information describing an entire company, subsidiaries, or contacts at the company. As another example, a record can be a project that the user is working on, such as an opportunity (e.g., a possible sale) with an existing partner, or a project that the user is trying to get. In one implementation of a multi-tenant database system, each record for the tenants has a unique identifier stored in a common table. A record has data fields that are defined by the structure of the object (e.g., fields of certain data types and purposes). A record can also have custom fields defined by a user. A field can be another record or include links thereto, thereby providing a parent-child relationship between the records.

FIG. 1 shows a system diagram of an example of a database system 100 for managing search results of CRM records, in accordance with some implementations. Database system 100 includes a variety of different hardware and/or software components which are in communication with each other. In the non-limiting example of FIG. 1, database system 100 includes at least one enterprise server 104, at least one log database 112, at least one CRM database 116, and at least one search graph database 120. A user system 108 can interact with database system 100 by sending and receiving data to and from one or more servers and/or databases of database system 100.

Enterprise server 104 may communicate with other components of database system 100. This communication may be facilitated through a combination of networks and interfaces. Enterprise server 104 may act as a communication intermediary among user system 108, log database 112, CRM database 116 and search graph database 120. For example, enterprise server 104 may receive a database search query from user system 108. The search query may be processed by enterprise server 104, which sends a request to search graph database 120. Upon receiving search results from search graph database 120, enterprise server 104 may forward the search results to user system 108 for display on a display device of user system 108. Independently, enterprise server 104 may retrieve and process data from log database 112 and CRM database 116 over an extended time to generate and update search graph data stored in search graph database 120.

A user system 108 may be a computing device capable of communicating via one or more data networks with a server. Examples of user system 108 include a desktop computer or portable electronic device such as a smartphone, a tablet, a laptop, a wearable device such as Google Glass®, another optical head-mounted display (OHMD) device, a smart watch, etc. In some instances, user system 108 may be another server or more than one computing device operated by more than one user.

Log database 112 can be configured to receive data from and transmit data to enterprise server 104. Log database 112 can store and maintain a collection of user logs, where each log records a respective user's interaction with data objects. For example, if a customer accesses an account, the customer's action may be recorded and stored in that customer's log maintained in log database 112. Each log may be structured to include a “history” or sequential list of log lines for each user action recorded in the log. A log line can include a variety of attributes such as a log type, a timestamp, an organization id, a user id, and an object id. Each attribute can have a value. Some of the values are also stored in data objects such as CRM records in CRM database 116. CRM database 116 can store and maintain CRM records of an organization such as accounts, opportunities, leads, cases, contacts, contracts, campaigns, solutions, quotes, purchase orders, etc. In some implementations, a user may access an account record, such as Account ABC, creating a log line in a log that includes Account ABC's object id from CRM database 116.

FIG. 2 shows a flow chart of an example of a method 200 for generating or updating a graph of nodes and edges to manage search results of data objects in a database system, in accordance with some implementations. Method 200 and other methods described herein may be implemented using database system 100 of FIG. 1, although the implementations of such methods are not limited to database system 100.

In block 204 of FIG. 2, one or more logs are identified by enterprise server 104 of database system 100. In some implementations, logs can be identified according to one or more parameters such as a duration between two system events and/or an organization id. In some implementations, a parameter can be configured to exclude logs unrelated to user interaction, such as server logs. For example, all user logs generated or updated in the past six months can be identified. As another example, all logs for a particular organization may be identified. In some implementations, these parameters may be combined to identify all logs from the past six months for the particular organization. The one or more parameters may correspond to log line attributes discussed further below.

FIG. 3 shows an example of an arrangement of log nodes and log node pairs for generating a graph of nodes and edges, in accordance with some implementations. A log 304 may include four log lines: log line 308 a, log line 308 b, log line 308 c, and log line 308 d. Each log line may be generated when a user interacts or “clicks” on a data object in an enterprise system. For example, Joe, a salesperson for JoeCorp, clicks on a lead for LeadCorp at 10:00 AM. Log line 308 a may be created with the following attributes: a log type indicating a user action, JoeCorp's organization id, Joe's user Id, the LeadCorp object id, and a timestamp of 2015-12-25-10:01:59. In some implementations, the timestamp for a click by a user may be recorded at a more granular level such as a millisecond. If Joe then clicks on contact Robert at 10:05 AM, then log line 308 b may be created. Log line 308 b may have the identical attribute values as log line 308 a for log type, organization id, and user id. However, log line 308 b can include the Robert object id and a timestamp of 2015-12-25-10:05:01. Log line 308 c and Log Line 308 d can include log lines created by Joe interacting with other various data objects.

Returning to FIG. 2, in block 208, log nodes are generated or updated based on the identified logs from block 204. In some implementations, when a log is processed or “mapped” by enterprise server 104 of FIG. 1, enterprise server 104 generates log nodes including a concatenation of some of the log line attributes. Also or alternatively, enterprise server 104 may remove some of the log line attributes before generating a log node.

For example, if a log line contains five attributes, the server may remove one attribute and concatenate the other four attributes into two sets. As depicted in FIG. 3, log line 308 d includes five attributes: “Log Type,” “Organization ID,” “User Id,” “Timestamp,” and “Object ID.” First, enterprise server 104 of FIG. 1 may remove the “Log Type” attribute. Next, enterprise server 104 may concatenate a first set of attributes, “Organization ID” and “User ID” into “Organization ID User Id”. Then, enterprise server 104 may concatenate the next set of attributes, “Timestamp” and “Object Id” into “Timestamp Object Id.” As shown in FIG. 3, log node 316 a may include both concatenated log line set 320, serving as key data, and concatenated log line set 324, serving as event data. The purpose of key data and event data are further explained below.

In some implementations, returning to FIG. 1, enterprise server 104 may sort log nodes in an ordered list. Key data, in some implementations, could index the log nodes in the list according to a value of the key data. In some implementations, a new list of log nodes may be generated. Also or alternatively, an existing list may be updated with new or modified log nodes. In some implementations, the log nodes in the updated list may be sorted according to the key data. Log nodes may be further sorted in a list according to the event data. Consequently, the log nodes may be sorted to correspond to a sequence in which a user accessed or took other action with respect to data objects in a database system. Moreover, based on the two list sorts according to key data and then event data or vice versa, the log nodes can be sorted lexicographically as well as chronologically.

For example, in FIG. 3, log node list 312 includes log nodes 316 a, 316 b, 316 c, 316 d, and 316 e first sorted according to concatenated log line set 320 and then further sorted by concatenated log line set 324. For example, log node 316 a may include key data “Org1_User1” and event data “10:00_ObjectAccount1.” Sorted second in the list may be log node 316 b, which includes key data “Org1_User1” and event data “10:02_ObjectContact3.” Sorted third in the list may be log node 316 c, which includes key data “Org1_User1” and event data “10:03_ObjectContact44.” Sorted fourth in the list may be log node 316 d, which includes key data “Org1_User1” and event data “10:04_ObjectCase1.” Finally, log node 316 e may include key data “Org1_User1” and event data “10:05_ObjectLead5.” Accordingly, the log nodes may be sorted first by the user and organization and then by the time the user accessed the data object.

Returning to FIG. 2, in block 212, log node pairs are determined. In some implementations, log node pairs may be determined according to consecutive log nodes in a list generated or updated in block 208. For example, a log node pair 332 a may be determined from log nodes 316 a and 316 b. Log node pair 332 b may be determined from log nodes 316 b and 316 c. Log node pair 332 c may be determined from log nodes 316 c and 316 d, etc. In some implementations, the log node pairs may be stored in a directory indexed by corresponding user id within an organization.

In some implementations, each log node pair can have the same key data. However, each log node pair may have different event data. For example, a log node pair may be determined where key data from two log nodes matches “User 1,” and the log node pair's event data from two log nodes includes “10:00_ObjectAccount1” or “10:02_ObjectContact3.” However, as another example, a log node pair may not be determined where key data from two log nodes matches “User 1,” but event data from two log nodes includes “10:00_ObjectAccount1” or “10:02_ObjectAccount1.” As such, log node pairs may not be determined when a user clicks on a link to the data object the user is currently visiting or when the user refreshes a page in a web browser.

In some implementations, enterprise server 104 of FIG. 1 may remove a log node pair from the list if a difference between the timestamps of consecutive log nodes exceeds a particular duration. For example, a log node pair could have the following event data: “10:00_ObjectAccount1” and “10:16_ObjectContact3.” A durational threshold of 15 minutes may be set to remove log node pairs exceeding that threshold. In this example, because the difference between timestamps of the log nodes in the log node pair exceeds 15 minutes, the log node pair may be removed by enterprise server 104. Also or alternatively, if a log node pair identifies a data object of the user who generated the log line, then enterprise server 104 may remove the log node pair. For instance, if “User A” visited a data object in the form of his profile, then enterprise server 104 may remove the log node pair. Also or alternatively, enterprise server 104 may remove log node pairs from the same user if the user disingenuously attempts to increase the number of visits to a data object. For example, there may be a maximum number of log node pairs allowable within a certain time period, and log node pairs from a user exceeding that maximum number may be removed.

Also or alternatively, for each log node pair determined by enterprise server 104, enterprise server 104 may create an additional log node pair that “inverts” or reverses the order of the log nodes. For example, as enterprise server 104 checks for consecutive log nodes, it may determine that log nodes 316 a and 316 b of FIG. 3 are a log node pair 332 a. At this point, enterprise server 104 may create an additional log node pair 332 b with the order of: log node 316 b, first, and log node 316 a, second. To further illustrate, log node pair 332 a may include “Object Id A_Object Id B,” while inverse log node pair 332 b may include “Object Id B_Object Id A.” In some implementations, an inverse log node pair may be included as part of an aggregation and weighting process described in further detail below.

Returning to FIG. 2, in block 216, log node pairs are aggregated. In some implementations, enterprise server 104 of FIG. 1 may count each log node pair of the same combination determined in block 212. For example, a list may have the following log node pairs: “10:00_ObjectAccount1_10:16_ObjectContact3,” “12:01_ObjectAccount1_12:02_ObjectContact3,” and “3:01_ObjectLead1_3:02_ObjectContact2.” Enterprise server 104 of FIG. 1 can process this list, returning an aggregate count of each log node pair combination and storing the counts in a new list. In this example, enterprise server 104 would return “ObjectAccount1_ObjectContact3: 2” and “ObjectLead1_ObjectContact2: 1.” Also or alternatively, as illustrated in this example, the timestamps from the log node pairs may be removed during the aggregation process. Furthermore, enterprise server 104 may create an associated relationship pointing from the CRM records for ObjectLead1 and ObjectContact2 to the log node pair. In some implementations, the count for each log node pair may be stored and updated accordingly in the associated CRM record.

In some implementations, the count or “sum” of each log node pair combination may be part of a weighted score. For example, in FIG. 3, an aggregated log node pair 340 a includes a log node pair count 348 for log node pair 344. The weighted score can include other weighting variables such as duration weight 352 and a user value 356. Weighted scores may correspond to a log node's relative importance. Also or alternatively, other variables may be incorporated or included later as part of the processing to adjust the weight of a log node pair.

Also or alternatively, the weighted score may include an incoming count and an outgoing count. For example, log node pair count 348 may have a first count of “5” inbound visits and a second count of “10” outbound visits. In this example, the 5 inbound visits may represent how often a user departed Object B to visit Object A, while the 10 outbound visits may represent how often a user departed Object A to visit Object B. Thus, a weighted score can account for how often a user visits a data object in relation to how often a user departs from that data object to a second data object. In some implementations, the ratio of the inbound count and outbound count may adjust the weight of a log node pair.

Returning to FIG. 2, in block 220, each log node pair's weight can be adjusted in some but not all implementations. For example, the weight of a log node pair may be adjusted after log nodes were updated according to block 208. Also or alternatively, the weight of a log node pair may be adjusted based on the difference in the timestamps or the “duration” between consecutive log nodes in a list. In some implementations, as the timestamp difference between consecutive nodes increases, the more the weight of the log node pair may be reduced. In FIG. 3, duration weight 352 can adjust the total weight of log node pair 344 either up or down. For example, the log node pair “1:00_ObjectAccount1_1:16_ObjectContact3” may have a difference between timestamps of “16,” whereas “7:30_ObjectAccount2_7:31_ObjectLead4” may have a difference between timestamps of “1.” In this example, the log node pair with a timestamp difference of 16 could have its weight reduced more than the log node pair with a timestamp difference of 1. Also or alternatively, for each log node pair combination a total amount of duration can be tracked. For example, aggregated log node pair 340 a may have a count 348 of “3” and a total duration weight of “52” (the total sum of the timestamp differences from the 3 log node pairs).

Returning to FIG. 2, in block 224, in some but not all implementations, user profiles are identified. In some implementations, the user profile associated with a log node pair is identified based on the user id within the log node pair. Enterprise server 104 of FIG. 1 may determine the “popularity” of a user profile based on how many other users are following or have “friended” that user. In addition, enterprise server 104 may generate a social network graph representing a user's friends in a social network. In some implementations, a ranking algorithm may determine the relative importance of a user based on the user's connections to friends in the social network graph. In one example, as the number of inbound friend connections increases, the greater the relative importance of the user. In other implementations, after an initial determination, a user's relative importance may be updated according to additional ranking determinations and stored in a database such as search graph database 120 of FIG. 1. Also or alternatively, during block 216 of FIG. 2 discussed above, some of a user's relative importance may be determined and stored in search graph database 120.

In some implementations, log node pairs from more popular users may have additional weight added and/or multiplied to a count of a log node pair according to the user's relative importance. For example, in FIG. 3, user value 356 of aggregated log node pair 340 a may be included in the weight of log node pair 344. When enterprise server 104 of FIG. 1 determines log node pairs described above in block 212 of FIG. 2, the log node pairs from a user with 10 friends may have log node pairs with user value 356 being “10.” Similarly, log node pairs that are determined by a user with 55 friends following him may have log node pairs with user value 356 being “55.” In other words, a user with more followers will have log node pairs with greater user weight. Thus, the number of times a more popular user clicks on a data object may have a more significant impact on the weight of a log node pair.

Returning to FIG. 2, in block 228, a weighted graph is generated or updated according to the weight of each log node pair and stored in a database such as search graph database 120 of FIG. 1. In some implementations, enterprise server 104 may process each log node pair, deriving a set of edges and a set of graph nodes. For example, a log node pair may include “ObjectCase1_ObjectCase2.” In this example, one graph node for “ObjectCase1” may be added to the set of graph nodes and a second graph node “ObjectCase2” may be added to the set of graph nodes. Also, an edge between “ObjectCase1” and “ObjectCase2” may be added to the set of edges. In some implementations, an edge can be a path joining two adjacent graph nodes. In some implementations, each graph node may have adjacency list tracking and storing the other graph nodes it shares an edge with. In other implementations, the weighted graph may be made up of subsets of weighted graphs, some of which may be connected and some of which may be disconnected.

FIG. 4 shows an example of a weighted graph 400 generated or updated using log node pairs, in accordance with some implementations. Weighted graph 400 includes graph nodes 404 a, 404 b, 404 c, 408 d, and 408 e with edges 408 a, 408 b, 408 c, 408 d, and 408 e. Graph node 404 a may have an edge 408 a connecting with node 404 b and an edge 408 b connecting with node 404 e. Graph node 404 a can be “adjacent” to graph nodes 404 b and 404 e, whereas graph node 404 b can be adjacent only to 404 a, in some implementations. In some implementations, weighted graph 400 may include undirected edges. Also or alternatively, the weighted graph may be bi-directional. For example, each log node pair may have an edge with arrows on both ends pointing to both log nodes. Also or alternatively, a bi-directional graph may have edges without arrows. In some implementations, log node pairs connected by bi-directional edges may be generated in part by the inverse log node pairs described above. In other implementations, weighted graph 400 may be directed, such that an edge may indicate the order of the log node pair. This may be represented by an edge with an arrow pointing from the first log node to the second log node.

Using FIGS. 3 and 4 as a non-limiting illustration of generating graph nodes and edges, log node pair 344 of FIG. 3 could have the value “Object ID A_Object ID B” and a count 348 of “55.” And graph nodes 404 a and 404 b and edge 408 a could be generated base on log node pair 344 and count 348. As such, graph node 404 a can have a value of “Object ID A,” graph node 404 b can represent the data object “Object ID B,” and edge 408 a with a weight of “55” can represent the importance of the connection between the two data objects. Similarly, graph nodes 404 c and 404 d could represent “Object ID C” and “Object ID D,” which may be generated based on a log node pair with the value “Object ID C_Object ID D” and count of “3.” Likewise, edge 408 c with the weight “3” could represent the importance between the two data objects.

Returning to FIG. 2, in block 232, in some but not all implementations, a query is sent by user system 108 of FIG. 1 and processed by enterprise server 104. In some implementations, the search query may include criterion such as words and phrases that may be identified as keywords to request data object search results from search graph database 120.

FIG. 5 shows an example of a user interface 500 with search results from a graph of nodes and edges generated or updated using log node pairs, in accordance with some implementations. User interface 500 includes search tool bar 504, results list 508, and search returns 512 a, 512 b, 512 c, and 512 d. In this example, a user has inputted the text “A problem” to search tool bar 504. In this example, the text sent as a query to enterprise server 104, resulted in list 508 being displayed in user interface 500.

Returning to FIG. 2, in block 236, ranked search results can be determined based on the log node pairs in the weighted graph. In some implementations, a ranking algorithm may perform a series of iterations over the weights of the edges between each graph node. For example, the PageRank™ algorithm may be used to rank the search results. In this example, the PageRank™ algorithm may determine a graph node's importance in determining the search order based on the “popularity” of the graph node. In other words, a graph node with more inbound edges, and particularly inbound edges from other popular graph nodes, may be more popular and will be displayed higher in the search return list. However, it will be apparent to one skilled in the art that other ranking algorithms may be used to perform a series of iterations over the weights of the edges between each graph node, for instance, a hyperlink-induced topic search algorithm.

Returning to FIG. 2, in block 240, ranked search results can be provided from a server to a user system for display in a user interface as illustrated in FIG. 5. Enterprise server 104 of FIG. 1 may first process the search results returned from a database of database system 100 before sending the results to user system 108. For example, in FIG. 5, search returns 512 a, 512 b, 512 c, and 512 d are displayed in results list 508 in order of the most relevant search returns for the search input: “A problem.”

Systems, apparatus, and methods are described below for implementing database systems and enterprise level social and business information networking systems in conjunction with the disclosed techniques. Such implementations can provide more efficient use of a database system. For instance, a user of a database system may not easily know when important information in the database has changed, e.g., about a project or client. Such implementations can provide feed tracked updates about such changes and other events, thereby keeping users informed.

By way of example, a user can update a record in the form of a CRM record, e.g., an opportunity such as a possible sale of 1000 computers. Once the record update has been made, a feed tracked update about the record update can then automatically be provided, e.g., in a feed, to anyone subscribing to the opportunity or to the user. Thus, the user does not need to contact a manager regarding the change in the opportunity, since the feed tracked update about the update is sent via a feed to the manager's feed page or other page.

FIG. 6A shows a block diagram of an example of an environment 10 in which an on-demand database service exists and can be used in accordance with some implementations. Environment 10 may include user systems 12, network 14, database system 16, processor system 17, application platform 18, network interface 20, tenant data storage 22, system data storage 24, program code 26, and process space 28. In other implementations, environment 10 may not have all of these components and/or may have other components instead of, or in addition to, those listed above.

A user system 12 may be implemented as any computing device(s) or other data processing apparatus such as a machine or system used by a user to access a database system 16. For example, any of user systems 12 can be a handheld and/or portable computing device such as a mobile phone, a smartphone, a laptop computer, or a tablet. Other examples of a user system include computing devices such as a work station and/or a network of computing devices. As illustrated in FIG. 6A (and in more detail in FIG. 6B) user systems 12 might interact via a network 14 with an on-demand database service, which is implemented in the example of FIG. 6A as database system 16.

An on-demand database service, implemented using system 16 by way of example, is a service that is made available to users who do not need to necessarily be concerned with building and/or maintaining the database system. Instead, the database system may be available for their use when the users need the database system, i.e., on the demand of the users. Some on-demand database services may store information from one or more tenants into tables of a common database image to form a multi-tenant database system (MTS). A database image may include one or more database objects. A relational database management system (RDBMS) or the equivalent may execute storage and retrieval of information against the database object(s). Application platform 18 may be a framework that allows the applications of system 16 to run, such as the hardware and/or software, e.g., the operating system. In some implementations, application platform 18 enables creation, managing and executing one or more applications developed by the provider of the on-demand database service, users accessing the on-demand database service via user systems 12, or third party application developers accessing the on-demand database service via user systems 12.

The users of user systems 12 may differ in their respective capacities, and the capacity of a particular user system 12 might be entirely determined by permissions (permission levels) for the current user. For example, when a salesperson is using a particular user system 12 to interact with system 16, the user system has the capacities allotted to that salesperson. However, while an administrator is using that user system to interact with system 16, that user system has the capacities allotted to that administrator. In systems with a hierarchical role model, users at one permission level may have access to applications, data, and database information accessible by a lower permission level user, but may not have access to certain applications, database information, and data accessible by a user at a higher permission level. Thus, different users will have different capabilities with regard to accessing and modifying application and database information, depending on a user's security or permission level, also called authorization.

Network 14 is any network or combination of networks of devices that communicate with one another. For example, network 14 can be any one or any combination of a LAN (local area network), WAN (wide area network), telephone network, wireless network, point-to-point network, star network, token ring network, hub network, or other appropriate configuration. Network 14 can include a TCP/IP (Transfer Control Protocol and Internet Protocol) network, such as the global internetwork of networks often referred to as the Internet. The Internet will be used in many of the examples herein. However, it should be understood that the networks that the present implementations might use are not so limited.

User systems 12 might communicate with system 16 using TCP/IP and, at a higher network level, use other common Internet protocols to communicate, such as HTTP, FTP, AFS, WAP, etc. In an example where HTTP is used, user system 12 might include an HTTP client commonly referred to as a “browser” for sending and receiving HTTP signals to and from an HTTP server at system 16. Such an HTTP server might be implemented as the sole network interface 20 between system 16 and network 14, but other techniques might be used as well or instead. In some implementations, the network interface 20 between system 16 and network 14 includes load sharing functionality, such as round-robin HTTP request distributors to balance loads and distribute incoming HTTP requests evenly over a plurality of servers. At least for users accessing system 16, each of the plurality of servers has access to the MTS' data; however, other alternative configurations may be used instead.

In one implementation, system 16, shown in FIG. 6A, implements a web-based CRM system. For example, in one implementation, system 16 includes application servers configured to implement and execute CRM software applications as well as provide related data, code, forms, web pages and other information to and from user systems 12 and to store to, and retrieve from, a database system related data, objects, and Webpage content. With a multi-tenant system, data for multiple tenants may be stored in the same physical database object in tenant data storage 22, however, tenant data typically is arranged in the storage medium(s) of tenant data storage 22 so that data of one tenant is kept logically separate from that of other tenants so that one tenant does not have access to another tenant's data, unless such data is expressly shared. In certain implementations, system 16 implements applications other than, or in addition to, a CRM application. For example, system 16 may provide tenant access to multiple hosted (standard and custom) applications, including a CRM application. User (or third party developer) applications, which may or may not include CRM, may be supported by the application platform 18, which manages creation, storage of the applications into one or more database objects and executing of the applications in a virtual machine in the process space of the system 16.

One arrangement for elements of system 16 is shown in FIGS. 6A and 6B, including a network interface 20, application platform 18, tenant data storage 22 for tenant data 23, system data storage 24 for system data 25 accessible to system 16 and possibly multiple tenants, program code 26 for implementing various functions of system 16, and a process space 28 for executing MTS system processes and tenant-specific processes, such as running applications as part of an application hosting service. Additional processes that may execute on system 16 include database indexing processes.

Several elements in the system shown in FIG. 6A include conventional, well-known elements that are explained only briefly here. For example, each user system 12 could include a desktop personal computer, workstation, laptop, PDA, cell phone, or any wireless access protocol (WAP) enabled device or any other computing device capable of interfacing directly or indirectly to the Internet or other network connection. The term “computing device” is also referred to herein simply as a “computer”. User system 12 typically runs an HTTP client, e.g., a browsing program, such as Microsoft's Internet Explorer browser, Netscape's Navigator browser, Opera's browser, or a WAP-enabled browser in the case of a cell phone, PDA or other wireless device, or the like, allowing a user (e.g., subscriber of the multi-tenant database system) of user system 12 to access, process and view information, pages and applications available to it from system 16 over network 14. Each user system 12 also typically includes one or more user input devices, such as a keyboard, a mouse, trackball, touch pad, touch screen, pen or the like, for interacting with a GUI provided by the browser on a display (e.g., a monitor screen, LCD display, OLED display, etc.) of the computing device in conjunction with pages, forms, applications and other information provided by system 16 or other systems or servers. Thus, “display device” as used herein can refer to a display of a computer system such as a monitor or touch-screen display, and can refer to any computing device having display capabilities such as a desktop computer, laptop, tablet, smartphone, a television set-top box, or wearable device such Google Glass® or other human body-mounted display apparatus. For example, the display device can be used to access data and applications hosted by system 16, and to perform searches on stored data, and otherwise allow a user to interact with various GUI pages that may be presented to a user. As discussed above, implementations are suitable for use with the Internet, although other networks can be used instead of or in addition to the Internet, such as an intranet, an extranet, a virtual private network (VPN), a non-TCP/IP based network, any LAN or WAN or the like.

According to one implementation, each user system 12 and all of its components are operator configurable using applications, such as a browser, including computer code run using a central processing unit such as an Intel Pentium® processor or the like. Similarly, system 16 (and additional instances of an MTS, where more than one is present) and all of its components might be operator configurable using application(s) including computer code to run using processor system 17, which may be implemented to include a central processing unit, which may include an Intel Pentium® processor or the like, and/or multiple processor units. Non-transitory computer-readable media can have instructions stored thereon/in, that can be executed by or used to program a computing device to perform any of the methods of the implementations described herein. Computer program code 26 implementing instructions for operating and configuring system 16 to intercommunicate and to process web pages, applications and other data and media content as described herein is preferably downloadable and stored on a hard disk, but the entire program code, or portions thereof, may also be stored in any other volatile or non-volatile memory medium or device as is well known, such as a ROM or RAM, or provided on any media capable of storing program code, such as any type of rotating media including floppy disks, optical discs, digital versatile disk (DVD), compact disk (CD), microdrive, and magneto-optical disks, and magnetic or optical cards, nanosystems (including molecular memory ICs), or any other type of computer-readable medium or device suitable for storing instructions and/or data. Additionally, the entire program code, or portions thereof, may be transmitted and downloaded from a software source over a transmission medium, e.g., over the Internet, or from another server, as is well known, or transmitted over any other conventional network connection as is well known (e.g., extranet, VPN, LAN, etc.) using any communication medium and protocols (e.g., TCP/IP, HTTP, HTTPS, Ethernet, etc.) as are well known. It will also be appreciated that computer code for the disclosed implementations can be realized in any programming language that can be executed on a client system and/or server or server system such as, for example, C, C++, HTML, any other markup language, Java™, JavaScript, ActiveX, any other scripting language, such as VBScript, and many other programming languages as are well known may be used. (Java™ is a trademark of Sun Microsystems, Inc.).

According to some implementations, each system 16 is configured to provide web pages, forms, applications, data and media content to user (client) systems 12 to support the access by user systems 12 as tenants of system 16. As such, system 16 provides security mechanisms to keep each tenant's data separate unless the data is shared. If more than one MTS is used, they may be located in close proximity to one another (e.g., in a server farm located in a single building or campus), or they may be distributed at locations remote from one another (e.g., one or more servers located in city A and one or more servers located in city B). As used herein, each MTS could include one or more logically and/or physically connected servers distributed locally or across one or more geographic locations. Additionally, the term “server” is meant to refer to one type of computing device such as a system including processing hardware and process space(s), an associated storage medium such as a memory device or database, and, in some instances, a database application (e.g., OODBMS or RDBMS) as is well known in the art. It should also be understood that “server system” and “server” are often used interchangeably herein. Similarly, the database objects described herein can be implemented as single databases, a distributed database, a collection of distributed databases, a database with redundant online or offline backups or other redundancies, etc., and might include a distributed database or storage network and associated processing intelligence.

FIG. 6B shows a block diagram of an example of some implementations of elements of FIG. 6A and various possible interconnections between these elements. That is, FIG. 6B also illustrates environment 10. However, in FIG. 6B elements of system 16 and various interconnections in some implementations are further illustrated. FIG. 6B shows that user system 12 may include processor system 12A, memory system 12B, input system 12C, and output system 12D. FIG. 6B shows network 14 and system 16. FIG. 6B also shows that system 16 may include tenant data storage 22, tenant data 23, system data storage 24, system data 25, User Interface (UI) 30, Application Program Interface (API) 32, PL/SOQL 34, save routines 36, application setup mechanism 38, application servers 50 ₁-50 _(N), system process space 52, tenant process spaces 54, tenant management process space 60, tenant storage space 62, user storage 64, and application metadata 66. In other implementations, environment 10 may not have the same elements as those listed above and/or may have other elements instead of, or in addition to, those listed above.

User system 12, network 14, system 16, tenant data storage 22, and system data storage 24 were discussed above in FIG. 6A. Regarding user system 12, processor system 12A may be any combination of one or more processors. Memory system 12B may be any combination of one or more memory devices, short term, and/or long term memory. Input system 12C may be any combination of input devices, such as one or more keyboards, mice, trackballs, scanners, cameras, and/or interfaces to networks. Output system 12D may be any combination of output devices, such as one or more monitors, printers, and/or interfaces to networks. As shown by FIG. 6B, system 16 may include a network interface 20 (of FIG. 6A) implemented as a set of application servers 50, an application platform 18, tenant data storage 22, and system data storage 24. Also shown is system process space 52, including individual tenant process spaces 54 and a tenant management process space 60. Each application server 50 may be configured to communicate with tenant data storage 22 and the tenant data 23 therein, and system data storage 24 and the system data 25 therein to serve requests of user systems 12. The tenant data 23 might be divided into individual tenant storage spaces 62, which can be either a physical arrangement and/or a logical arrangement of data. Within each tenant storage space 62, user storage 64 and application metadata 66 might be similarly allocated for each user. For example, a copy of a user's most recently used (MRU) items might be stored to user storage 64. Similarly, a copy of MRU items for an entire organization that is a tenant might be stored to tenant storage space 62. A UI 30 provides a user interface and an API 32 provides an application programmer interface to system 16 resident processes to users and/or developers at user systems 12. The tenant data and the system data may be stored in various databases, such as one or more Oracle® databases.

Application platform 18 includes an application setup mechanism 38 that supports application developers' creation and management of applications, which may be saved as metadata into tenant data storage 22 by save routines 36 for execution by subscribers as one or more tenant process spaces 54 managed by tenant management process 60 for example. Invocations to such applications may be coded using PL/SOQL 34 that provides a programming language style interface extension to API 32. A detailed description of some PL/SOQL language implementations is discussed in commonly assigned U.S. Patent No. 7,730,478, titled METHOD AND SYSTEM FOR ALLOWING ACCESS TO DEVELOPED APPLICATIONS VIA A MULTI-TENANT ON-DEMAND DATABASE SERVICE, by Craig Weissman, issued on Jun. 1, 2010, and hereby incorporated by reference in its entirety and for all purposes. Invocations to applications may be detected by one or more system processes, which manage retrieving application metadata 66 for the subscriber making the invocation and executing the metadata as an application in a virtual machine.

Each application server 50 may be communicably coupled to database systems, e.g., having access to system data 25 and tenant data 23, via a different network connection. For example, one application server 50 ₁ might be coupled via the network 14 (e.g., the Internet), another application server 50 _(N-1) might be coupled via a direct network link, and another application server 50 _(N) might be coupled by yet a different network connection. Transfer Control Protocol and Internet Protocol (TCP/IP) are typical protocols for communicating between application servers 50 and the database system. However, it will be apparent to one skilled in the art that other transport protocols may be used to optimize the system depending on the network interconnect used.

In certain implementations, each application server 50 is configured to handle requests for any user associated with any organization that is a tenant. Because it is desirable to be able to add and remove application servers from the server pool at any time for any reason, there is preferably no server affinity for a user and/or organization to a specific application server 50. In one implementation, therefore, an interface system implementing a load balancing function (e.g., an F5 Big-IP load balancer) is communicably coupled between the application servers 50 and the user systems 12 to distribute requests to the application servers 50. In one implementation, the load balancer uses a least connections algorithm to route user requests to the application servers 50. Other examples of load balancing algorithms, such as round robin and observed response time, also can be used. For example, in certain implementations, three consecutive requests from the same user could hit three different application servers 50, and three requests from different users could hit the same application server 50. In this manner, by way of example, system 16 is multi-tenant, wherein system 16 handles storage of, and access to, different objects, data and applications across disparate users and organizations.

As an example of storage, one tenant might be a company that employs a sales force where each salesperson uses system 16 to manage their sales process. Thus, a user might maintain contact data, leads data, customer follow-up data, performance data, goals and progress data, etc., all applicable to that user's personal sales process (e.g., in tenant data storage 22). In an example of a MTS arrangement, since all of the data and the applications to access, view, modify, report, transmit, calculate, etc., can be maintained and accessed by a user system having nothing more than network access, the user can manage his or her sales efforts and cycles from any of many different user systems. For example, if a salesperson is visiting a customer and the customer has Internet access in their lobby, the salesperson can obtain critical updates as to that customer while waiting for the customer to arrive in the lobby.

While each user's data might be separate from other users' data regardless of the employers of each user, some data might be organization-wide data shared or accessible by a plurality of users or all of the users for a given organization that is a tenant. Thus, there might be some data structures managed by system 16 that are allocated at the tenant level while other data structures might be managed at the user level. Because an MTS might support multiple tenants including possible competitors, the MTS should have security protocols that keep data, applications, and application use separate. Also, because many tenants may opt for access to an MTS rather than maintain their own system, redundancy, up-time, and backup are additional functions that may be implemented in the MTS. In addition to user-specific data and tenant-specific data, system 16 might also maintain system level data usable by multiple tenants or other data. Such system level data might include industry reports, news, postings, and the like that are sharable among tenants.

In certain implementations, user systems 12 (which may be client systems) communicate with application servers 50 to request and update system-level and tenant-level data from system 16 that may involve sending one or more queries to tenant data storage 22 and/or system data storage 24. System 16 (e.g., an application server 50 in system 16) automatically generates one or more SQL statements (e.g., one or more SQL queries) that are designed to access the desired information. System data storage 24 may generate query plans to access the requested data from the database.

Each database can generally be viewed as a collection of objects, such as a set of logical tables, containing data fitted into predefined categories. A “table” is one representation of a data object, and may be used herein to simplify the conceptual description of objects and custom objects according to some implementations. It should be understood that “table” and “object” may be used interchangeably herein. Each table generally contains one or more data categories logically arranged as columns or fields in a viewable schema. Each row or record of a table contains an instance of data for each category defined by the fields. For example, a CRM database may include a table that describes a customer with fields for basic contact information such as name, address, phone number, fax number, etc. Another table might describe a purchase order, including fields for information such as customer, product, sale price, date, etc. In some multi-tenant database systems, standard entity tables might be provided for use by all tenants. For CRM database applications, such standard entities might include tables for case, account, contact, lead, and opportunity data objects, each containing pre-defined fields. It should be understood that the word “entity” may also be used interchangeably herein with “object” and “table”.

In some multi-tenant database systems, tenants may be allowed to create and store custom objects, or they may be allowed to customize standard entities or objects, for example by creating custom fields for standard objects, including custom index fields. Commonly assigned U.S. Pat. No. 7,779,039, titled CUSTOM ENTITIES AND FIELDS IN A MULTI-TENANT DATABASE SYSTEM, by Weissman et al., issued on Aug. 17, 2010, and hereby incorporated by reference in its entirety and for all purposes, teaches systems and methods for creating custom objects as well as customizing standard objects in a multi-tenant database system. In certain implementations, for example, all custom entity data rows are stored in a single multi-tenant physical table, which may contain multiple logical tables per organization. It is transparent to customers that their multiple “tables” are in fact stored in one large table or that their data may be stored in the same table as the data of other customers.

FIG. 7A shows a system diagram of an example of architectural components of an on-demand database service environment 900, in accordance with some implementations. A client machine located in the cloud 904, generally referring to one or more networks in combination, as described herein, may communicate with the on-demand database service environment via one or more edge routers 908 and 912. A client machine can be any of the examples of user systems 12 described above. The edge routers may communicate with one or more core switches 920 and 924 via firewall 916. The core switches may communicate with a load balancer 928, which may distribute server load over different pods, such as the pods 940 and 944. The pods 940 and 944, which may each include one or more servers and/or other computing resources, may perform data processing and other operations used to provide on-demand services. Communication with the pods may be conducted via pod switches 932 and 936. Components of the on-demand database service environment may communicate with a database storage 956 via a database firewall 948 and a database switch 952.

As shown in FIGS. 7A and 7B, accessing an on-demand database service environment may involve communications transmitted among a variety of different hardware and/or software components. Further, the on-demand database service environment 900 is a simplified representation of an actual on-demand database service environment. For example, while only one or two devices of each type are shown in FIGS. 7A and 7B, some implementations of an on-demand database service environment may include anywhere from one to many devices of each type. Also, the on-demand database service environment need not include each device shown in FIGS. 7A and 7B, or may include additional devices not shown in FIGS. 7A and 7B.

Moreover, one or more of the devices in the on-demand database service environment 900 may be implemented on the same physical device or on different hardware. Some devices may be implemented using hardware or a combination of hardware and software. Thus, terms such as “data processing apparatus,” “machine,” “server” and “device” as used herein are not limited to a single hardware device, but rather include any hardware and software configured to provide the described functionality.

The cloud 904 is intended to refer to a data network or combination of data networks, often including the Internet. Client machines located in the cloud 904 may communicate with the on-demand database service environment to access services provided by the on-demand database service environment. For example, client machines may access the on-demand database service environment to retrieve, store, edit, and/or process information.

In some implementations, the edge routers 908 and 912 route packets between the cloud 904 and other components of the on-demand database service environment 900. The edge routers 908 and 912 may employ the Border Gateway Protocol (BGP). The BGP is the core routing protocol of the Internet. The edge routers 908 and 912 may maintain a table of IP networks or ‘prefixes’, which designate network reachability among autonomous systems on the Internet.

In one or more implementations, the firewall 916 may protect the inner components of the on-demand database service environment 900 from Internet traffic. The firewall 916 may block, permit, or deny access to the inner components of the on-demand database service environment 900 based upon a set of rules and other criteria. The firewall 916 may act as one or more of a packet filter, an application gateway, a stateful filter, a proxy server, or any other type of firewall.

In some implementations, the core switches 920 and 924 are high-capacity switches that transfer packets within the on-demand database service environment 900. The core switches 920 and 924 may be configured as network bridges that quickly route data between different components within the on-demand database service environment. In some implementations, the use of two or more core switches 920 and 924 may provide redundancy and/or reduced latency.

In some implementations, the pods 940 and 944 may perform the core data processing and service functions provided by the on-demand database service environment. Each pod may include various types of hardware and/or software computing resources. An example of the pod architecture is discussed in greater detail with reference to FIG. 7B.

In some implementations, communication between the pods 940 and 944 may be conducted via the pod switches 932 and 936. The pod switches 932 and 936 may facilitate communication between the pods 940 and 944 and client machines located in the cloud 904, for example via core switches 920 and 924. Also, the pod switches 932 and 936 may facilitate communication between the pods 940 and 944 and the database storage 956.

In some implementations, the load balancer 928 may distribute workload between the pods 940 and 944. Balancing the on-demand service requests between the pods may assist in improving the use of resources, increasing throughput, reducing response times, and/or reducing overhead. The load balancer 928 may include multilayer switches to analyze and forward traffic.

In some implementations, access to the database storage 956 may be guarded by a database firewall 948. The database firewall 948 may act as a computer application firewall operating at the database application layer of a protocol stack. The database firewall 948 may protect the database storage 956 from application attacks such as structure query language (SQL) injection, database rootkits, and unauthorized information disclosure.

In some implementations, the database firewall 948 may include a host using one or more forms of reverse proxy services to proxy traffic before passing it to a gateway router. The database firewall 948 may inspect the contents of database traffic and block certain content or database requests. The database firewall 948 may work on the SQL application level atop the TCP/IP stack, managing applications' connection to the database or SQL management interfaces as well as intercepting and enforcing packets traveling to or from a database network or application interface.

In some implementations, communication with the database storage 956 may be conducted via the database switch 952. The multi-tenant database storage 956 may include more than one hardware and/or software components for handling database queries. Accordingly, the database switch 952 may direct database queries transmitted by other components of the on-demand database service environment (e.g., the pods 940 and 944) to the correct components within the database storage 956.

In some implementations, the database storage 956 is an on-demand database system shared by many different organizations. The on-demand database service may employ a multi-tenant approach, a virtualized approach, or any other type of database approach. On-demand database services are discussed in greater detail with reference to FIGS. 7A and 7B.

FIG. 7B shows a system diagram further illustrating an example of architectural components of an on-demand database service environment, in accordance with some implementations. The pod 944 may be used to render services to a user of the on-demand database service environment 900. In some implementations, each pod may include a variety of servers and/or other systems. The pod 944 includes one or more content batch servers 964, content search servers 968, query servers 982, file servers 986, access control system (ACS) servers 980, batch servers 984, and app servers 988. Also, the pod 944 includes database instances 990, quick file systems (QFS) 992, and indexers 994. In one or more implementations, some or all communication between the servers in the pod 944 may be transmitted via the switch 936.

The content batch servers 964 may handle requests internal to the pod. These requests may be long-running and/or not tied to a particular customer. For example, the content batch servers 964 may handle requests related to log mining, cleanup work, and maintenance tasks.

The content search servers 968 may provide query and indexer functions. For example, the functions provided by the content search servers 968 may allow users to search through content stored in the on-demand database service environment.

The file servers 986 may manage requests for information stored in the file storage 998. The file storage 998 may store information such as documents, images, and basic large objects (BLOBs). By managing requests for information using the file servers 986, the image footprint on the database may be reduced.

The query servers 982 may be used to retrieve information from one or more file systems. For example, the query system 982 may receive requests for information from the app servers 988 and then transmit information queries to the NFS 996 located outside the pod.

The pod 944 may share a database instance 990 configured as a multi-tenant environment in which different organizations share access to the same database. Additionally, services rendered by the pod 944 may call upon various hardware and/or software resources. In some implementations, the ACS servers 980 may control access to data, hardware resources, or software resources.

In some implementations, the batch servers 984 may process batch jobs, which are used to run tasks at specified times. Thus, the batch servers 984 may transmit instructions to other servers, such as the app servers 988, to trigger the batch jobs.

In some implementations, the QFS 992 may be an open source file system available from Sun Microsystems® of Santa Clara, Calif. The QFS may serve as a rapid-access file system for storing and accessing information available within the pod 944. The QFS 992 may support some volume management capabilities, allowing many disks to be grouped together into a file system. File system metadata can be kept on a separate set of disks, which may be useful for streaming applications where long disk seeks cannot be tolerated. Thus, the QFS system may communicate with one or more content search servers 968 and/or indexers 994 to identify, retrieve, move, and/or update data stored in the network file systems 996 and/or other storage systems.

In some implementations, one or more query servers 982 may communicate with the NFS 996 to retrieve and/or update information stored outside of the pod 944. The NFS 996 may allow servers located in the pod 944 to access information to access files over a network in a manner similar to how local storage is accessed.

In some implementations, queries from the query servers 922 may be transmitted to the NFS 996 via the load balancer 928, which may distribute resource requests over various resources available in the on-demand database service environment. The NFS 996 may also communicate with the QFS 992 to update the information stored on the NFS 996 and/or to provide information to the QFS 992 for use by servers located within the pod 944.

In some implementations, the pod may include one or more database instances 990. The database instance 990 may transmit information to the QFS 992. When information is transmitted to the QFS, it may be available for use by servers within the pod 944 without using an additional database call.

In some implementations, database information may be transmitted to the indexer 994. Indexer 994 may provide an index of information available in the database 990 and/or QFS 992. The index information may be provided to file servers 986 and/or the QFS 992.

Some but not all of the techniques described or referenced herein are implemented as part of or in conjunction with a social networking database system, also referred to herein as a social networking system or as a social network. Social networking systems have become a popular way to facilitate communication among people, any of whom can be recognized as users of a social networking system. One example of a social networking system is Chatter®, provided by salesforce.com, inc. of San Francisco, Calif. salesforce.com, inc. is a provider of social networking services, CRM services and other database management services, any of which can be accessed and used in conjunction with the techniques disclosed herein in some implementations. These various services can be provided in a cloud computing environment, for example, in the context of a multi-tenant database system. Thus, the disclosed techniques can be implemented without having to install software locally, that is, on computing devices of users interacting with services available through the cloud. While the disclosed implementations are often described with reference to Chatter®, those skilled in the art should understand that the disclosed techniques are neither limited to Chatter® nor to any other services and systems provided by salesforce.com, inc. and can be implemented in the context of various other database systems and/or social networking systems such as Facebook®, LinkedIn®, Twitter®, Google+®, Yammer® and Jive® by way of example only.

Some social networking systems can be implemented in various settings, including organizations. For instance, a social networking system can be implemented to connect users within an enterprise such as a company or business partnership, or a group of users within such an organization. For instance, Chatter® can be used by employee users in a division of a business organization to share data, communicate, and collaborate with each other for various social purposes often involving the business of the organization. In the example of a multi-tenant database system, each organization or group within the organization can be a respective tenant of the system, as described in greater detail herein.

In some social networking systems, users can access one or more social network feeds, which include information updates presented as items or entries in the feed. Such a feed item can include a single information update or a collection of individual information updates. A feed item can include various types of data including character-based data, audio data, image data and/or video data. A social network feed can be displayed in a graphical user interface (GUI) on a display device such as the display of a computing device as described herein. The information updates can include various social network data from various sources and can be stored in an on-demand database service environment. In some implementations, the disclosed methods, apparatus, systems, and computer-readable storage media may be configured or designed for use in a multi-tenant database environment.

In some implementations, a social networking system may allow a user to follow data objects in the form of CRM records such as cases, accounts, or opportunities, in addition to following individual users and groups of users. The “following” of a record stored in a database, as described in greater detail herein, allows a user to track the progress of that record when the user is subscribed to the record. Updates to the record, also referred to herein as changes to the record, are one type of information update that can occur and be noted on a social network feed such as a record feed or a news feed of a user subscribed to the record. Examples of record updates include field changes in the record, updates to the status of a record, as well as the creation of the record itself. Some records are publicly accessible, such that any user can follow the record, while other records are private, for which appropriate security clearance/permissions are a prerequisite to a user following the record.

Information updates can include various types of updates, which may or may not be linked with a particular record. For example, information updates can be social media messages submitted by a user or can otherwise be generated in response to user actions or in response to events. Examples of social media messages include: posts, comments, indications of a user's personal preferences such as “likes” and “dislikes”, updates to a user's status, uploaded files, and user-submitted hyperlinks to social network data or other network data such as various documents and/or web pages on the Internet. Posts can include alpha-numeric or other character-based user inputs such as words, phrases, statements, questions, emotional expressions, and/or symbols. Comments generally refer to responses to posts or to other information updates, such as words, phrases, statements, answers, questions, and reactionary emotional expressions and/or symbols. Multimedia data can be included in, linked with, or attached to a post or comment. For example, a post can include textual statements in combination with a JPEG image or animated image. A like or dislike can be submitted in response to a particular post or comment. Examples of uploaded files include presentations, documents, multimedia files, and the like.

Users can follow a record by subscribing to the record, as mentioned above. Users can also follow other entities such as other types of data objects, other users, and groups of users. Feed tracked updates regarding such entities are one type of information update that can be received and included in the user's news feed. Any number of users can follow a particular entity and thus view information updates pertaining to that entity on the users' respective news feeds. In some social networks, users may follow each other by establishing connections with each other, sometimes referred to as “friending” one another. By establishing such a connection, one user may be able to see information generated by, generated about, or otherwise associated with another user. For instance, a first user may be able to see information posted by a second user to the second user's personal social network page. One implementation of such a personal social network page is a user's profile page, for example, in the form of a web page representing the user's profile. In one example, when the first user is following the second user, the first user's news feed can receive a post from the second user submitted to the second user's profile feed. A user's profile feed is also referred to herein as the user's “wall,” which is one example of a social network feed displayed on the user's profile page.

In some implementations, a social network feed may be specific to a group of users of a social networking system. For instance, a group of users may publish a news feed. Members of the group may view and post to this group feed in accordance with a permissions configuration for the feed and the group. Information updates in a group context can also include changes to group status information.

In some implementations, when data such as posts or comments input from one or more users are submitted to a social network feed for a particular user, group, object, or other construct within a social networking system, an email notification or other type of network communication may be transmitted to all users following the user, group, or object in addition to the inclusion of the data as a feed item in one or more feeds, such as a user's profile feed, a news feed, or a record feed. In some social networking systems, the occurrence of such a notification is limited to the first instance of a published input, which may form part of a larger conversation. For instance, a notification may be transmitted for an initial post, but not for comments on the post. In some other implementations, a separate notification is transmitted for each such information update.

The term “multi-tenant database system” generally refers to those systems in which various elements of hardware and/or software of a database system may be shared by one or more customers. For example, a given application server may simultaneously process requests for a great number of customers, and a given database table may store rows of data such as feed items for a potentially much greater number of customers.

An example of a “user profile” or “user's profile” is a database object or set of objects configured to store and maintain data about a given user of a social networking system and/or database system. The data can include general information, such as name, title, phone number, a photo, a biographical summary, and a status, e.g., text describing what the user is currently doing. As mentioned herein, the data can include social media messages created by other users. Where there are multiple tenants, a user is typically associated with a particular tenant. For example, a user could be a salesperson of a company, which is a tenant of the database system that provides a database service.

The term “record” generally refers to a data entity having fields with values and stored in database system. An example of a record is an instance of a data object created by a user of the database service, for example, in the form of a CRM record about a particular (actual or potential) business relationship or project. The record can have a data structure defined by the database service (a standard object) or defined by a user (custom object). For example, a record can be for a business partner or potential business partner (e.g., a client, vendor, distributor, etc.) of the user, and can include information describing an entire company, subsidiaries, or contacts at the company. As another example, a record can be a project that the user is working on, such as an opportunity (e.g., a possible sale) with an existing partner, or a project that the user is trying to get. In one implementation of a multi-tenant database system, each record for the tenants has a unique identifier stored in a common table. A record has data fields that are defined by the structure of the object (e.g., fields of certain data types and purposes). A record can also have custom fields defined by a user. A field can be another record or include links thereto, thereby providing a parent-child relationship between the records.

The terms “social network feed” and “feed” are used interchangeably herein and generally refer to a combination (e.g., a list) of feed items or entries with various types of information and data. Such feed items can be stored and maintained in one or more database tables, e.g., as rows in the table(s), that can be accessed to retrieve relevant information to be presented as part of a displayed feed. The term “feed item” (or feed element) generally refers to an item of information, which can be presented in the feed such as a post submitted by a user. Feed items of information about a user can be presented in a user's profile feed of the database, while feed items of information about a record can be presented in a record feed in the database, by way of example. A profile feed and a record feed are examples of different types of social network feeds. A second user following a first user and a record can receive the feed items associated with the first user and the record for display in the second user's news feed, which is another type of social network feed. In some implementations, the feed items from any number of followed users and records can be combined into a single social network feed of a particular user.

As examples, a feed item can be a social media message, such as a user-generated post of text data, and a feed tracked update to a record or profile, such as a change to a field of the record. Feed tracked updates are described in greater detail herein. A feed can be a combination of social media messages and feed tracked updates. Social media messages include text created by a user, and may include other data as well. Examples of social media messages include posts, user status updates, and comments. Social media messages can be created for a user's profile or for a record. Posts can be created by various users, potentially any user, although some restrictions can be applied. As an example, posts can be made to a wall section of a user's profile page (which can include a number of recent posts) or a section of a record that includes multiple posts. The posts can be organized in chronological order when displayed in a GUI, for instance, on the user's profile page, as part of the user's profile feed. In contrast to a post, a user status update changes a status of a user and can be made by that user or an administrator. A record can also have a status, the update of which can be provided by an owner of the record or other users having suitable write access permissions to the record. The owner can be a single user, multiple users, or a group.

In some implementations, a comment can be made on any feed item. In some implementations, comments are organized as a list explicitly tied to a particular feed tracked update, post, or status update. In some implementations, comments may not be listed in the first layer (in a hierarchal sense) of feed items, but listed as a second layer branching from a particular first layer feed item.

A “feed tracked update,” also referred to herein as a “feed update,” is one type of information update and generally refers to data representing an event. A feed tracked update can include text generated by the database system in response to the event, to be provided as one or more feed items for possible inclusion in one or more feeds. In one implementation, the data can initially be stored, and then the database system can later use the data to create text for describing the event. Both the data and/or the text can be a feed tracked update, as used herein. In various implementations, an event can be an update of a record and/or can be triggered by a specific action by a user. Which actions trigger an event can be configurable. Which events have feed tracked updates created and which feed updates are sent to which users can also be configurable. Social media messages and other types of feed updates can be stored as a field or child object of the record. For example, the feed can be stored as a child object of the record.

A “group” is generally a collection of users. In some implementations, the group may be defined as users with a same or similar attribute, or by membership. In some implementations, a “group feed”, also referred to herein as a “group news feed”, includes one or more feed items about any user in the group. In some implementations, the group feed also includes information updates and other feed items that are about the group as a whole, the group's purpose, the group's description, and group records and other objects stored in association with the group. Threads of information updates including group record updates and social media messages, such as posts, comments, likes, etc., can define group conversations and change over time.

An “entity feed” or “record feed” generally refers to a feed of feed items about a particular record in the database. Such feed items can include feed tracked updates about changes to the record and posts made by users about the record. An entity feed can be composed of any type of feed item. Such a feed can be displayed on a page such as a web page associated with the record, e.g., a home page of the record. As used herein, a “profile feed” or “user's profile feed” generally refers to a feed of feed items about a particular user. In one example, the feed items for a profile feed include posts and comments that other users make about or send to the particular user, and status updates made by the particular user. Such a profile feed can be displayed on a page associated with the particular user. In another example, feed items in a profile feed could include posts made by the particular user and feed tracked updates initiated based on actions of the particular user.

While some of the disclosed implementations may be described with reference to a system having an application server providing a front end for an on-demand database service capable of supporting multiple tenants, the disclosed implementations are not limited to multi-tenant databases nor deployment on application servers. Some implementations may be practiced using various database architectures such as ORACLE®, DB2® by IBM and the like without departing from the scope of the implementations claimed.

It should be understood that some of the disclosed implementations can be embodied in the form of control logic using hardware and/or computer software in a modular or integrated manner. Other ways and/or methods are possible using hardware and a combination of hardware and software.

Any of the disclosed implementations may be embodied in various types of hardware, software, firmware, and combinations thereof. For example, some techniques disclosed herein may be implemented, at least in part, by computer-readable media that include program instructions, state information, etc., for performing various services and operations described herein. Examples of program instructions include both machine code, such as produced by a compiler, and files containing higher-level code that may be executed by a computing device such as a server or other data processing apparatus using an interpreter. Examples of computer-readable media include, but are not limited to: magnetic media such as hard disks, floppy disks, and magnetic tape; optical media such as flash memory, compact disk (CD) or digital versatile disk (DVD); magneto-optical media; and hardware devices specially configured to store program instructions, such as read-only memory (“ROM”) devices and random access memory (“RAM”) devices. A computer-readable medium may be any combination of such storage devices.

Any of the operations and techniques described in this application may be implemented as software code to be executed by a processor using any suitable computer language such as, for example, Java, C++ or Perl using, for example, object-oriented techniques. The software code may be stored as a series of instructions or commands on a computer-readable medium. Computer-readable media encoded with the software/program code may be packaged with a compatible device or provided separately from other devices (e.g., via Internet download). Any such computer-readable medium may reside on or within a single computing device or an entire computer system, and may be among other computer-readable media within a system or network. A computer system or computing device may include a monitor, printer, or other suitable display for providing any of the results mentioned herein to a user.

While various implementations have been described herein, it should be understood that they have been presented by way of example only, and not limitation. Thus, the breadth and scope of the present application should not be limited by any of the implementations described herein, but should be defined only in accordance with the following and later-submitted claims and their equivalents. 

What is claimed is:
 1. A database system configurable to: maintain, by a server of the database system, at least one database storing a plurality of logs, each log providing a history of user actions in a computing environment; identify, by a server of the database system, at least one of the logs as satisfying at least one parameter; generate or update, by a server of the database system, at least one of a plurality of log nodes based on the identified at least one log, each log node having key data for indexing the log node and having event data representing an accessed data object, the log nodes being sortable in a first ordered list according to the key data of each log node; determine, by a server of the database system, a plurality of log node pairs of consecutive log nodes in the first ordered list, each log node pair determined based on each log node in the pair having matching key data and different event data; aggregate, by a server of the database system, the log node pairs, the log node pairs being sortable in a second ordered list, each log node pair having a relative importance in comparison with other log node pairs; and generate or update, by a server of the database system, a graph of nodes and edges according to the relative importances of the log node pairs in the second ordered list, the graph capable of being processed as part of a database search to return ranked search results of data objects stored in the database system.
 2. The database system of claim 1, the database system further configurable to: adjust, by a server of the database system, a weight contributing to a relative importance of a log node pair, the adjustment based on a time difference between consecutive log nodes of the pair.
 3. The database system of claim 1, the database system further configurable to: identify, by a server of the database system, a plurality of social network users having a plurality of links between and/or among each other; and update, by a server of the database system, a weight of a log node pair according to a relative importance of at least one of the social network users.
 4. The database system of claim 1, the database system further configurable to: generate or update, by a server of the database system, an inverse pair for a log node pair, the inverse pair inverting an order of log nodes of the log node pair; and update, by a server of the database system, the graph with the inverse pair for the log node pair, the inverse pair providing bi-directional traversal of the graph.
 5. The database system of claim 1, wherein each log node pair comprises or is associated with a first customer relationship management (CRM) record and a second CRM record.
 6. The database system of claim 1, wherein each log node has an associated timestamp indicating a time when a log was accessed.
 7. The database system of claim 6, the database system further configurable to: determine, by a server of the database system, a duration between consecutive log nodes of a log node pair based on timestamps associated with the consecutive log nodes; determine, by a server of the database system, that the duration meets or exceeds a threshold; and remove, by a server of the database system, responsive to determining that the duration meets or exceeds the threshold, the log node pair from the second ordered list.
 8. The database system of claim 6, wherein the log nodes in the first ordered list are further sortable according to the timestamp associated with each log node.
 9. The database system of claim 1, the database system further configurable to: receive, at a server of the database system, a search query comprising at least one criterion; determine, by a server of the database system, a search result based on a traversal of the graph using at least one log node pair; and provide, by a server of the database system, the search result to a display device of a user.
 10. A method comprising: maintaining, by a server of a database system, at least one database storing a plurality of logs, each log providing a history of user actions in a computing environment; identifying, by a server of the database system, at least one of the logs as satisfying at least one parameter; generating or updating, by a server of the database system, at least one of a plurality of log nodes based on the identified at least one log, each log node having key data for indexing the log node and having event data representing an accessed data object, the log nodes being sortable in a first ordered list according to the key data of each log node; determining, by a server of the database system, a plurality of log node pairs of consecutive log nodes in the first ordered list, each log node pair determined based on each log node in the pair having matching key data and different event data; aggregating, by a server of the database system, the log node pairs, the log node pairs being sortable in a second ordered list, each log node pair having a relative importance in comparison with other log node pairs; and generating or updating, by a server of the database system, a graph of nodes and edges according to the relative importances of the log node pairs in the second ordered list, the graph capable of being processed as part of a database search to return ranked search results of data objects stored in the database system.
 11. The method of claim 10, further comprising: adjusting, by a server of the database system, a weight contributing to a relative importance of a log node pair, the adjustment based on a time difference between consecutive log nodes of the pair.
 12. The method of claim 10, further comprising: identifying, by a server of the database system, a plurality of social network users having a plurality of links between and/or among each other; and updating, by a server of the database system, a weight of a log node pair according to a relative importance of at least one of the social network users.
 13. The method of claim 10, further comprising: generating or updating, by a server of the database system, an inverse pair for a log node pair, the inverse pair inverting an order of log nodes of the log node pair; and updating, by a server of the database system, the graph with the inverse pair for the log node pair, the inverse pair providing bi-directional traversal of the graph.
 14. The method of claim 10, wherein each log node has an associated timestamp indicating a time when a log was accessed.
 15. The method of claim 14, further comprising: removing at least one log node pair from the first ordered list that exceeds a durational threshold between consecutive log nodes, exceeding the durational threshold being determined by the timestamps of consecutive log nodes.
 16. A computer program product comprising computer-readable program code to be executed by one or more processors when retrieved from a non-transitory computer-readable medium, the program code including instructions configured to cause: maintaining, by a server of a database system, at least one database storing a plurality of logs, each log providing a history of user actions in a computing environment; identifying, by a server of the database system, at least one of the logs as satisfying at least one parameter; generating or updating, by a server of the database system, at least one of a plurality of log nodes based on the identified at least one log, each log node having key data for indexing the log node and having event data representing an accessed data object, the log nodes being sortable in a first ordered list according to the key data of each log node; determining, by a server of the database system, a plurality of log node pairs of consecutive log nodes in the first ordered list, each log node pair determined based on each log node in the pair having matching key data and different event data; aggregating, by a server of the database system, the log node pairs, the log node pairs being sortable in a second ordered list, each log node pair having a relative importance in comparison with other log node pairs; and generating or updating, by a server of the database system, a graph of nodes and edges according to the relative importances of the log node pairs in the second ordered list, the graph capable of being processed as part of a database search to return ranked search results of data objects stored in the database system.
 17. The computer program product of claim 16, the instructions further configured to cause: adjusting, by a server of the database system, a weight contributing to a relative importance of a log node pair, the adjustment based on a time difference between consecutive log nodes of the pair.
 18. The computer program product of claim 16, the instructions further configured to cause: identifying, by a server of the database system, a plurality of social network users having a plurality of links between and/or among each other; and updating, by a server of the database system, a weight of a log node pair according to a relative importance of at least one of the social network users.
 19. The computer program product of claim 16, the instructions further configured to cause: generating or updating, by a server of the database system, an inverse pair for a log node pair, the inverse pair inverting an order of log nodes of the log node pair; and updating, by a server of the database system, the graph with the inverse pair for the log node pair, the inverse pair providing bi-directional traversal of the graph.
 20. The computer program product of claim 16, wherein each log node pair comprises or is associated with a first CRM record and a second CRM record. 